An Application of Klop's Counterexample to a Higher-order Rewrite System

نویسنده

  • Dan Nesmith
چکیده

In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, which has the Church-Rosser property, to a Church-Rosser rst-order algebraic rewrite system may not be Church-Rosser. In contrast, Breazu-Tannen recently showed that augmenting any Church-Rosser rst-order algebraic rewrite system with the simply-typed lambda calculus results in a Church-Rosser rewrite system. In addition, Breazu-Tannen and Gallier have shown that the second-order polymorphic lambda calculus can be added to such rewrite systems without compromising the Church-Rosser property (for terms which can be provably typed). There are other systems for which a Church-Rosser result would be desirable, among them being SP F IX, the simply-typed lambda calculus extended with surjective pairing and xed points. This paper will show that Klop's untyped counterexample can be lifted to a typed system to demonstrate that SP F IX is not Church-Rosser.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Application of Klop ' s Counterexampleto a Higher

In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, which has the Church-Rosser property, to a Church-Rosser rst-order algebraic rewrite system may not be Church-Rosser. In contrast, Breazu-Tannen recently showed that augmenting any Church-Rosser rst-order algebraic rewrite system with the simply-typed lambda calculus results in a Church-Rosser re...

متن کامل

Development Closed Critical Pairs

The class of orthogonal rewriting systems (rewriting systems where rewrite steps cannot depend on one another) is the main class of not-necessarily-terminating rewriting systems for which connuence is known to hold. Huet and Toyama have shown that for left-linear rst-order term rewriting systems (TRSs) the orthogonality restriction can be relaxed somewhat by allowing critical pairs (arising fro...

متن کامل

A Termination Ordering for Higher Order Rewrite System

We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate the necessary properties of the termination functions for our method to apply, thus describe a class of diierent orderings. We also give a counterexample to a previously published extensio...

متن کامل

An Invariant-preserved Transformation of State Machines from Equations into Rewrite Rules

We present an approach to the transformation of state machines from a restricted subclass of equational theories into rewrite theories, and show the transformation preserves invariant properties. Invariantpreservation of the transformation guarantees that a counterexample that is found to an invariant by model checking a generated rewrite theory is also the counterexample to the corresponding i...

متن کامل

Debugging of Web Applications with Web-TLR

WEB-TLR is a Web verification engine that is based on the well-established Rewriting Logic– Maude/LTLR tandem for Web system specification and model-checking. In WEB-TLR, Web applications are expressed as rewrite theories that can be formally verified by using the Maude built-in LTLR model-checker. Whenever a property is refuted, a counterexample trace is delivered that reveals an undesired, er...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1989